Solving the maximum subsequence sum and related problems using BSP/CGM model and multi-GPU CUDA
نویسندگان
چکیده
منابع مشابه
Lecture 3 — Maximum Contiguous Subsequence Sum and The Substitution Method
1.1 Algorithm 1: Brute Force Immediate from the definition is an algorithm with O(n3) work and O(log n) span. This algorithm examines all possible combinations of subsequences and for each one of them, it computes the sum and takes the maximum. Note that every subsequence of s can be represented by a starting position i and an ending position j. We will use the shorthand si.. j to denote the su...
متن کاملthe evaluation of language related engagment and task related engagment with the purpose of investigating the effect of metatalk and task typology
abstract while task-based instruction is considered as the most effective way to learn a language in the related literature, it is oversimplified on various grounds. different variables may affect how students are engaged with not only the language but also with the task itself. the present study was conducted to investigate language and task related engagement on the basis of the task typolog...
15 صفحه اولon the relationship between using discourse markers and the quality of expository and argumentative academic writing of iranian english majors
the aim of the present study was to investigate the frequency and the type of discourse markers used in the argumentative and expository writings of iranian efl learners and the differences between these text features in the two essay genres. the study also aimed at examining the influence of the use of discourse markers on the participants’ writing quality. to this end the discourse markers us...
15 صفحه اولPRACTICAL PROBLEMS AND THE EFFICACY OF INTRAOSSEOUS INFUSION: SOLVING THE PROBLEMS BY EMPLOYING AN ANIMAL MODEL
In critically ill infants and children, intravascular (IV) access is sometimes very difficult. In such cases intraosseous (IO) infusion should be used as the method of choice. However, in practice, different problems are experienced with this procedure. To overcome the practical problems and to confirm the efficacy of IO infusion in reversing hypovolemic shock, an animal model was used by ...
متن کاملAccelerated Steiner Tree Problem Solving on GPU with CUDA
The Steiner Tree Problem in Graphs (STPG) is an important NP-hard combinatorial optimization problem arising naturally in many applications including network routing, social media analysis, power grid routing and in the context of the semantic web. We present the first parallel heuristics for the solution of the STPG for GPU with CUDA, and show that the achieved speedups for different kinds of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Brazilian Computer Society
سال: 2016
ISSN: 0104-6500,1678-4804
DOI: 10.1186/s13173-016-0045-4